The Search for New Axioms
نویسندگان
چکیده
The independence results in set theory invite the search for new and justified axioms. In Chapter 1 I set the stage by examining three approaches to justifying the axioms of standard set theory (stage theory, Godel's approach, and reflection principles) and argue that the approach via reflection principles is the most successful. In Chapter 2 I analyse the limitations of ZF and use this analysis to set up a mathematically precise minimal hurdle which any set of new a~ioms must overcome if it is to effect a significant reduction in incompleteness. In Chapter 3 I examine the standard method of justifying new axioms-reflection principles-and prove a result which shows that no reflection principle (known to be consistent via large cardinals) can overcome the minimal hurdle and yield a significant reduction in incompleteness. In Chapter 4 I introduce a new approach to justifying new axioms-extension principles-and show that such principles can overcome the minimal hurdle and much more, in particular, such principles imply PD and that the theory of second-order arithmetic cannot be altered by set size forcing. I show that in a sense (which I make precise) these principles are inevitable. In Chapter 5 I close with a brief discussion of meta-mathematical justifications stemming from the work of Woodin. These touch on the continuum hypothesis and other questions which are beyond the reach of standard large cardinals. Thesis Supervisor: Vann McGee Title: Professor
منابع مشابه
Inclusive Pruning: a New Class of Pruning Axiom for Unordered Search and Its Application to Classification Learning
This paper presents a new class of pruning axiom for unordered search. Previous pruning axioms for unordered search identify operators that should not be applied in order to prune states reached via those operators. In contrast, the new pruning axioms identify operators that should be applied and prune states that are not reached via those operators. Specific pruning axioms employing both these...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملOn characterizations of the fully rational fuzzy choice functions
In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.
متن کاملEfficiency distribution and expected efficiencies in DEA with imprecise data
Several methods have been proposed for ranking the decision-making units (DMUs) in data envelopment analysis (DEA) with imprecise data. Some methods have only used the upper bound efficiencies to rank DMUs. However, some other methods have considered both of the lower and upper bound efficiencies to rank DMUs. The current paper shows that these methods did not consider the DEA axioms and may be...
متن کاملSome New Properties of the Searching Probability
Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...
متن کامل$LG$-topology
In this paper, we introduce a new model of point free topology for point-set topology. We study the basic concepts in this structure and will find that it is naturally close to point-set topology.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003